A path-level exact parallelization strategy for sequential simulation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A practical oracle for sequential code parallelization

of the Dissertation . . . . . . . . . . . . . . . . . . . . . . . . . . . xvi Chapter

متن کامل

Critical Path Heuristic for Automatic Parallelization

This paper presents an algorithm to heuristically partition the data dependence graph representing a basic block or a hyper block of code in order to assign instructions to available processing cores. The algorithm relies on the observation that the critical path in the data dependence graph defines the lower bound on the schedule length of a block and hence the instructions on the critical pat...

متن کامل

A Parallelization Framework for Exact Knowledge Hiding in Transactional Databases

The hiding of sensitive knowledge, mined from transactional databases, is one of the primary goals of privacy preserving data mining. The increased storage capabilities of modern databases and the necessity for hiding solutions of superior quality, paved the way for parallelization of the hiding process. In this paper, we introduce a novel framework for decomposition and parallel solving of a c...

متن کامل

a study on thermodynamic models for simulation of 1,3 butadiene purification columns

attempts have been made to study the thermodynamic behavior of 1,3 butadiene purification columns with the aim of retrofitting those columns to more energy efficient separation schemes. 1,3 butadiene is purified in two columns in series through being separated from methyl acetylene and 1,2 butadiene in the first and second column respectively. comparisons have been made among different therm...

A Parallelization of Dijkstra's Shortest Path Algorithm

The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-eecient. We propose simple criteria which divide Dijkstra's sequential SSSP algorithm into a number of phases, such that the operations within a phase can be done in parallel. We give a PRAM algorithm based on these criteria and analyze its performance on random digraphs with random ed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Geosciences

سال: 2018

ISSN: 0098-3004

DOI: 10.1016/j.cageo.2017.09.011